By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 25, Issue 4, pp. 697-906

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Computing Solutions Uniquely Collapses the Polynomial Hierarchy

Lane A. Hemaspaandra, Ashish V. Naik, Mitsunori Ogihara, and Alan L. Selman

pp. 697-708

BibTeX  Abstract Full Text:  PDF

A Method of Constructing Selection Networks with $O(\log n)$ Depth

S. Jimbo and A. Maruoka

pp. 709-739

BibTeX  Abstract Full Text:  PDF

Analysis of Backoff Protocols for Multiple Access Channels

Johan Håstad, Tom Leighton, and Brian Rogoff

pp. 740-774

BibTeX  Abstract Full Text:  PDF

New Techniques for Exact and Approximate Dynamic Closest-Point Problems

Sanjiv Kapoor and Michiel Smid

pp. 775-796

BibTeX  Abstract Full Text:  PDF

Efficient Parallel Algorithms for Chordal Graphs

Philip N. Klein

pp. 797-827

BibTeX  Abstract Full Text:  PDF

The Sublogarithmic Alternating Space World

Maciej Liskiewicz and Rüdiger Reischuk

pp. 828-861

BibTeX  Abstract Full Text:  PDF

Tree-Adjoining Language Parsing in $O(n^6 )$ Time

Sanguthevar Rajasekaran

pp. 862-873

BibTeX  Abstract Full Text:  PDF

An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem

Prakash Ramanan

pp. 874-893

BibTeX  Abstract Full Text:  PDF

Convergence in Distribution for Best-Fit Decreasing

Wansoo T. Rhee and Michel Talagrand

pp. 894-906

BibTeX  Abstract Full Text:  PDF